Interval Pattern Avoidance for Arbitrary Root Systems
نویسندگان
چکیده
منابع مشابه
Interval Pattern Avoidance for Arbitrary Root Systems
We extend the idea of interval pattern avoidance defined by Yong and the author for Sn to arbitrary Weyl groups using the definition of pattern avoidance due to Billey and Braden, and Billey and Postnikov. We show that, as previously shown by Yong and the author for GLn, interval pattern avoidance is a universal tool for characterizing which Schubert varieties have certain local properties, and...
متن کاملPattern avoidance in dynamical systems
Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed intervals. This means that the points belonging to a sufficiently long orbit cannot appear in any arbitrary order. The admissible patterns are the...
متن کاملPattern Avoidance
Consider a sequence of letters or numbers. Does a pattern exist that is avoided by the sequence? This topic is a very popular area of research in mathematics for its promising utility in computer science and other branches of mathematics, the elegant proofs and solutions, and the many open problems that still remain. Section 1 of this paper provides definitions, notations, and some properties o...
متن کاملStrict Bounds for Pattern Avoidance
Cassaigne conjectured in 1994 that any pattern with m distinct variables of length at least 3(2m−1) is avoidable over a binary alphabet, and any pattern with m distinct variables of length at least 2 is avoidable over a ternary alphabet. Building upon the work of Rampersad and the power series techniques of Bell and Goh, we obtain both of these suggested strict bounds. Similar bounds are also o...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2010
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2010-080-2